Formalising Actors in Linear Logic
نویسندگان
چکیده
We present a logical formalism of the actor-based concurrent object oriented computation in terms of the deduction in linear logic. By encoding messages and objects in the actor model as formulae of linear logic, the distributed state of the actor computation, regarded as a connguration, can be represented as a multiset of object formulae and message formulae. Methods are encoded as a special form of logical implication describing the eeect of the communication between objects and messages. With this logical encoding , actor based concurrent computation can be fully modelled as a deduction procedure in linear logic. In the paper, we provide a detailed mapping of the actor model into the logical system. It is shown that, with such a mapping, the logical semantics of actors can be developed.
منابع مشابه
A Step Towards the Standardisation of HIV Care Practices
Recent improvements to HIV care at the NHS Lothian Board have concentrated on a re-mapping of the processes involved in their existing Integrated Care Pathway (ICP), in order to incorporate improvements identified during the ICP implementation and consider new advances in care. Our work aims to extend and enhance this mapping by formalising care workflows using our logic-based tool WorkflowFM. ...
متن کاملLinear Formulas in Continuous Logic
We prove that continuous sentences preserved by the ultramean construction (a generalization of the ultraproduct construction) are exactly those sentences which are approximated by linear sentences. Continuous sentences preserved by linear elementary equivalence are exactly those sentences which are approximated in the Riesz space generated by linear sentences. Also, characterizations for linea...
متن کاملFormalising a Model of the -calculus in HOL-ST
Most new theorem provers implement strong and complicated type theories which eliminate some of the limitations of simple type theories such as the HOL logic. A more accessible alternative might be to use a combination of set theory and simple type theory as in HOL-ST which is a version of the HOL system supporting a ZF-like set theory in addition to higher order logic. This paper presents a ca...
متن کاملFormalising the translation of CTL into Lμ
The translation of the temporal logic CTL [2] into the modal μ-calculus Lμ [10] is formalised in the HOL theorem prover [8].
متن کاملA Tableau Algorithm for Linear-Time Temporal Logic with Constraints
Often when formalising dynamic systems, constraints such as exactly “n” of a set of values hold. In this paper, we consider reasoning about propositional linear time temporal logics in the presence of such constraints. First, we provide experimental results from a developed prover for a tableau-like algorithm with constraints, showing the advantages of this method over other tableau provers. Ho...
متن کامل